منابع مشابه
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We determine sufficient minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure that G has a Ks,t-factor. Our result extends the work of Zhao, who determined the minimum degree threshold which guarantees that a bipartite graph has a Ks,s-factor.
متن کاملA Note on Bipartite Graph Tiling
Bipartite graph tiling was studied by Zhao [7] who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of Ks,s. Let s < t be fixed positive integers. Hladký and Schacht [3] gave minimum degree conditions for a balanced bipartite graph on 2m(s + t) vertices to contain m vertex disjoint copies of Ks,t. Their results w...
متن کاملNote making a K 4-free graph bipartite
The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2010
ISSN: 0895-4801,1095-7146
DOI: 10.1137/080726434